2.17. A parallel program that obtains a speedup greater than p-the number of processes or threads-is sometimes said to have superlinear speedup. However, many authors don't count programs that overcome "resource limitations" as having superlinear speedup. For example, a program that must use secondary storage for its data when it's run on a single processor system might be able to fit all its data into main memory when run on a large distributed-memory system. Give another example of how a program might overcome a resource limitation and obtain speedups greater than p. | |
| View Solution | |
| << Back | Next >> |